Kernel Protection Against Just-In-Time Code Reuse
نویسندگان
چکیده
منابع مشابه
Just-in-Time Compiler Assisted Object Reclamation and Space Reuse
Garbage collection consumes significant overhead to reclaim memory used by dead (i.e., unreachable) objects in applications. This paper explores techniques for compiler assisted object reclamation and allocation on an actual JVM. Thereinto, the just-in-time compiler identifies dead objects using pointer and escape analysis combining liveness information and inserts calls to free them. The garba...
متن کاملHeapSentry: Kernel-Assisted Protection against Heap Overflows
The last twenty years have witnessed the constant reaction of the security community to memory corruption attacks and the evolution of attacking techniques in order to circumvent the newly-deployed countermeasures. In this evolution, the heap of a process received little attention and thus today, the problem of heap overflows is largely unsolved. In this paper we present HeapSentry, a system de...
متن کاملSource code based protection against CRAs
As the threat potential of Code-Reuse Attacks (CRAs) is rising we want to develop a tool that can mitigate such state-of-the-art attacks (e.g., the attack dubbed Counterfeit Object-Oriented Programming (COOP)). This attack is particularly hard to defend against since traditional Control Flow Integrity (CFI) approaches are useless. Based on source code recompilation techniques we want to harden ...
متن کاملAgent-Based Network Protection Against Malicious Code
This paper presents an agent-based approach to Network Intrusion Prevention on corporate networks, emphasizing the protection from fast-spreading mobile malicious code outbreaks (e.g. worms) and related threats. Agents are not only used as a system-integration platform, but we use modern agent approaches to trust modeling and distributed task allocation to efficiently detect and also counter th...
متن کاملJust-In-Time Kernel Regression for Expectation Propagation
We propose an efficient nonparametric strategy for learning a message operator in expectation propagation (EP), which takes as input the set of incoming messages to a factor node, and produces an outgoing message as output. This learned operator replaces the multivariate integral required in classical EP, which may not have an analytic expression. We use kernel-based regression, which is traine...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Privacy and Security
سال: 2019
ISSN: 2471-2566,2471-2574
DOI: 10.1145/3277592